Point Information Gain and Multidimensional Data Analysis
نویسندگان
چکیده
منابع مشابه
Point Information Gain and Multidimensional Data Analysis
We generalize the point information gain (PIG) and derived quantities, i.e., point information gain entropy (PIE) and point information gain entropy density (PIED), for the case of the Rényi entropy and simulate the behavior of PIG for typical distributions. We also use these methods for the analysis of multidimensional datasets. We demonstrate the main properties of PIE/PIED spectra for the re...
متن کاملPoint Divergence Gain and Multidimensional Data Sequences Analysis
We introduce novel information-entropic variables—a Point Divergence Gain (Ω α ), a Point Divergence Gain Entropy (Iα), and a Point Divergence Gain Entropy Density (Pα)—which are derived from the Rényi entropy and describe spatio-temporal changes between two consecutive discrete multidimensional distributions. The behavior of Ω α is simulated for typical distributions and, together with Iα and ...
متن کاملMultidimensional Analysis of Distributed Data Warehouse of Antiquity Information
Aiming at the problems in the management and sharing research of antique information, this paper discussed the necessity to build antique information distributed data warehouse. The data warehouse architecture and the multidimensional data model were put forward, by usingonline analysis processing (OLAP) the multidimensional analysis of antique distributed data warehouse was presented, and a mu...
متن کاملBusiness Intelligence: Multidimensional Data Analysis
The relational database model is probably the most frequently used database model today. It has its strengths, but it doesn’t perform very well with complex queries and analysis of very large sets of data. As computers have grown more potent, resulting in the possibility to store very large data volumes, the need for efficient analysis and processing of such data sets has emerged. The concept o...
متن کاملComputing Information Gain in Data Streams
Computing information gain in general data streams, in which we do not make any assumptions on the underlying distributions or domains, is a hard problem, severely constrained by the limitations on memory space. We present a simple randomized solution to this problem that is time and space efficient as well as tolerates a relative error that has a theoretical upper bound. It is based on a novel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Entropy
سال: 2016
ISSN: 1099-4300
DOI: 10.3390/e18100372